Judgment Aggregators and Boolean Algebra Homomorphisms

The theory of Boolean algebras can be fruitfully applied to judgment aggregation: Assuming universality, systematicity and a sufficiently rich agenda, there is a correspondence between (i) non-trivial deductively closed judgment aggregators and (ii) Boolean algebra homomorphisms defined on the power-set algebra of the electorate. Furthermore, there is a correspondence between (i) consistent complete judgment aggregators and (ii) 2-valued Boolean algebra homomorphisms defined on the power-set algebra of the electorate. Since the shell of such a homomorphism equals the set of winning coalitions and since (ultra)filters are shells of (2-valued) Boolean algebra homomorphisms, we suggest an explanation for the effectiveness of the (ultra)filter method in social choice theory. From the (ultra)filter property of the set of winning coalitions, one obtains two general impossibility theorems for judgment aggregation on finite electorates, even without the Pareto principle. 2000 Mathematics Subject Classification. 91B14; 03G05. Journal of Economic Literature classification. D71.